package datastructure_algorithm.bst;

// 非递归实现
public class BST2<E extends Comparable<E>> {

	private class Node {
		public E e;
		public Node left, right;

		public Node(E e) {
			this.e = e;
		}
	}

	private Node root;
	private int size;

	public int size() {
		return size;
	}

	public boolean isEmpty() {
		return size == 0;
	}

	public void add(E e) {

	}

	public boolean contains(E e) {
		return false;
	}

	public E minimum() {
		if (size == 0)
			throw new IllegalArgumentException("BST is empty.");
		return null;
	}

	public E maximum() {
		if (size == 0)
			throw new IllegalArgumentException("BST is empty.");
		return null;
	}

	public E removeMin() {
		return null;
	}

	public E removeMax() {
		return null;
	}

	public void remove(E e) {

	}

}
